An Improved Clarke and Wright Algorithm to Solve the Capacitated Vehicle Routing Problem
نویسندگان
چکیده
منابع مشابه
An Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery
The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...
متن کاملAn Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery
The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...
متن کاملImproved Particle Swarm Algorithm to Solve the Vehicle Routing Problem
Vehicle routing problem is a NP hard problem. To solve the premature convergence problem of the particle swarm optimization, an improved particle swarm optimization method was proposed. In the first place, introducing the neighborhood topology, defining two new concepts lepton and hadron. Lepton are particles within the scope of neighborhood, which have weak interaction between each other, so t...
متن کاملAn Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem
The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...
متن کاملAn Empirical Study of a Pure Genetic Algorithm to Solve the Capacitated Vehicle Routing Problem
Despite some successful applications of genetic algorithms (GAs) for solving the capacitated vehicle routing problems, they usually rely on problem-specific components or hybridization with other heuristics for obtaining competitive solutions. These problemspecific and hybridized characteristics complicate the GA implementation for solving reallife problems. In this paper, a pure GA for the cap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Engineering, Technology & Applied Science Research
سال: 2013
ISSN: 1792-8036,2241-4487
DOI: 10.48084/etasr.292